High-Speed Inverse Square Roots
نویسندگان
چکیده
Inverse square roots are used in several digital signal processing, multimedia, and scientific computing applications. This paper presents a high-speed method for computing inverse square roots. This method uses a table lookup, operand modification, and multiplication to obtain an initial approximation to the inverse square root. This is followed by a modified Newton-Raphson iteration, consisting of one square, one multiply-complement, and one multiplyadd operation. The initial approximation and NewtonRaphson iteration employ specialized hardware to reduce the delay, area, and power dissipation. Application of this method is illustrated through the design of an inverse square root unit for operands in the IEEE single precision format. An implementation of this unit with a 4-layer metal, 2.5 Volt, 0.25 micron CMOS standard cell library has a cycle time of 6.7 ns, an area of 0.41 mm2, a latency of five cycles, and a throughput of one result per cycle.
منابع مشابه
High-Speed Double-Precision Computation of Reciprocal, Division, Square Root and Inverse Square Root
A new method for the high-speed computation of double-precision floating-point reciprocal, division, square root, and inverse square root operations is presented in this paper. This method employs a second-degree minimax polynomial approximation to obtain an accurate initial estimate of the reciprocal and the inverse square root values, and then performs a modified Goldschmidt iteration. The hi...
متن کاملModeling and Realization of the Floating Point Inverse Square Root, Square Root, and Division unit (fP ISD) Using VHDL and FPGAs
In this paper, we model and synthesis a high speed Arithmetic inverse square root, square root, and division (ISD) unit based on existing algorithms similar to the unit in [3]. With area/speed tradeoff limitation, our concentration was on designing high speed Arithmetic units with moderate area increase. Our concentration on the (ISD) unit using digit recurrence algorithms led to the modeling o...
متن کاملReciprocation, Square Root, Inverse Square Root, and Some Elementary Functions Using Small Multipliers
ÐThis paper deals with the computation of reciprocals, square roots, inverse square roots, and some elementary functions using small tables, small multipliers, and, for some functions, a final alargeo (almost full-length) multiplication. We propose a method, based on argument reduction and series expansion, that allows fast evaluation of these functions in high precision. The strength of this m...
متن کاملAlgorithms for implementing roots, inverse and inverse roots in hardware
In applications as in future MIMO communication systems a massive computation of complex matrix operations, such as QR decomposition, is performed. In these matrix operations, the functions roots, inverse and inverse roots are computed in large quantities. Therefore, to obtain high enough performance in such applications, efficient algorithms are highly important. Since these algorithms need to...
متن کاملTransformations computations: Power, Roots and Inverse
This paper presents some results of an annihilated element in Banach algebra, and in specific case, for any square matrix. The developed method significantly improves the computational aspects of transformations calculus and especially for finding powers and roots of any annihilated element. An example is given to compare the proposed method with some other methods to show the efficienc...
متن کامل